Homomesy of Alignments in Perfect Matchings
نویسنده
چکیده
We investigate the existence of a group action τ that is homomesic with respect to alignments, a type of statistic in perfect matchings. Homomesy is defined as the consistency of an average, and perfect matchings are defined as the set of all partitions of 1 to 2n into pairs. We take advantage of the bijection between labeled Dyck paths and perfect matchings to investigate to investigate the possibility of defining τ inductively. We also relate perfect matchings to the oscillating tableaux and discover relationships that support the possibility of the existence of τ but do not prove it. We find some surprisingly clean formulae for statistical averages of the analogue to the number of alignments for oscillating tableaux of arbitrary shape, which suggests that τ may exist for more general contexts than just perfect matchings.
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملComplete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملDistribution of Crossings, Nestings and Alignments of Two Edges in Matchings and Partitions
We construct an involution on set partitions which keeps track of the numbers of crossings, nestings and alignments of two edges. We derive then the symmetric distribution of the numbers of crossings and nestings in partitions, which generalizes a recent result of Klazar and Noy in perfect matchings. By factorizing our involution through bijections between set partitions and some path diagrams ...
متن کاملA Note on Statistical Averages for Oscillating Tableaux
Oscillating tableaux are certain walks in Young’s lattice of partitions; they generalize standard Young tableaux. The shape of an oscillating tableau is the last partition it visits and the length of an oscillating tableau is the number of steps it takes. We define a new statistic for oscillating tableaux that we call weight: the weight of an oscillating tableau is the sum of the sizes of all t...
متن کاملPerfect Matchings of Cellular Graphs
We introduce a family of graphs, called cellular, and consider the problem of enumerating their perfect matchings. We prove that the number of perfect matchings of a cellular graph equals a power of 2 tiroes the number of perfect matchings of a certain subgraph, called the core of the graph. This yields, as a special case, a new proof of the fact that the Aztec diamond graph of order n introduc...
متن کامل